data structures & algorithms Practice Questions Answers Test with Solutions & More Shortcuts

Question : 6

The indirect change of the values of a variable in one module by another module is called

a) internal change

b) inter-module change

c) side effect

d) all the above

Question : 7

Linked lists are best suited for

a) relatively permanent collections of data

b) the size of the structure and the data in the structure are constantly changing

c) both of above situation

d) none of above situation

Question : 8

In a Heap tree values in a node is greater than

a) every value in left sub tree and smaller than right sub tree

b) every value in children of it

c) Both of above conditions are true

d) None of above conditions are true

Question : 9

A connected graph T without any cycles is called

a) tree graph

b) free tree

c) tree

d) All of the above

Question : 10

Finding the location of the element with a given value is called

a) Traversal

b) Search

c) Sort

d) All of the above